Convexity Properties Associated with Nonconvex Quadratic Matrix Functions and Applications to Quadratic Programming
نویسنده
چکیده
We establish several convexity results which are concerned with nonconvex quadratic matrix (QM) functions: strong duality of quadratic matrix programming problems, convexity of the image of mappings comprised of several QM functions and the existence of a corresponding SLemma. As a consequence of our results, we prove that a class of quadratic problems involving several functions with similar matrix terms has a zero duality gap. We present applications to robust optimization, solution of linear systems immune to implementation errors and to the problem of computing the Chebyshev center of an intersection of balls.
منابع مشابه
FGP approach to multi objective quadratic fractional programming problem
Multi objective quadratic fractional programming (MOQFP) problem involves optimization of several objective functions in the form of a ratio of numerator and denominator functions which involve both contains linear and quadratic forms with the assumption that the set of feasible solutions is a convex polyhedral with a nite number of extreme points and the denominator part of each of the objecti...
متن کاملAlgorithms for Solving Nonconvex Block Constrained Quadratic Problems
Non-convex Quadratically Constrained Quadratic Programs with block-separable convex constraints are generally NP-hard. These problems appear in many applications such as estimation and control, complex unimodular programming, and MAX-CUT type problems. SDP relaxation is the best known upper bound approximation for this problem. We suggest the Block Optimal Ascent (BOA) algorithm to obtain lower...
متن کاملAnalytical aspects of the interval unilateral quadratic matrix equations and their united solution sets
This paper introduces the emph{interval unilateral quadratic matrix equation}, $IUQe$ and attempts to find various analytical results on its AE-solution sets in which $A,B$ and $CCC$ are known real interval matrices, while $X$ is an unknown matrix. These results are derived from a generalization of some results of Shary. We also give sufficient conditions for non-emptiness of some quasi-solutio...
متن کاملA TRUST-REGION SEQUENTIAL QUADRATIC PROGRAMMING WITH NEW SIMPLE FILTER AS AN EFFICIENT AND ROBUST FIRST-ORDER RELIABILITY METHOD
The real-world applications addressing the nonlinear functions of multiple variables could be implicitly assessed through structural reliability analysis. This study establishes an efficient algorithm for resolving highly nonlinear structural reliability problems. To this end, first a numerical nonlinear optimization algorithm with a new simple filter is defined to locate and estimate the most ...
متن کاملOn Quadratic Convergence of DC Proximal Newton Algorithm for Nonconvex Sparse Learning in High Dimensions
We propose a DC proximal Newton algorithm for solving nonconvex regularized sparse learning problems in high dimensions. Our proposed algorithm integrates the proximal Newton algorithm with multi-stage convex relaxation based on difference of convex (DC) programming, and enjoys both strong computational and statistical guarantees. Specifically, by leveraging a sophisticated characterization of ...
متن کامل